Improved bounds for hybrid flow shop scheduling with multiprocessor tasks
نویسندگان
چکیده
منابع مشابه
Improved bounds for hybrid flow shop scheduling with multiprocessor tasks
In this paper, we investigate the problem of minimizing makespan in a multistage hybrid flow-shop scheduling with multiprocessor tasks. To generate high-quality approximate solutions to this challenging NP-hard problem, we propose a discrepancy search heuristic that is based on the new concept of adjacent discrepancies. Moreover, we describe a new lower bound based on the concept of dual feasib...
متن کاملImproved Bounds for Flow Shop Scheduling
We resolve an open question raised by Feige & Scheideler by showing that the best known approximation algorithm for flow shops is essentially tight with respect to the used lower bound on the optimal makespan. We also obtain a nearly tight hardness result for the general version of flow shops, where jobs are not required to be processed on each machine. Similar results hold true when the object...
متن کاملParticle swarm optimization with cocktail decoding method for hybrid flow shop scheduling problems with multiprocessor tasks
This paper addresses the problem of multiprocessor task-scheduling in a hybrid flow shop (HFS) problem to minimize the makespan. Due to the complex nature of an HFS problem, it is decomposed into the following two sequential decision problems: determining the job permutation in stage 1, followed by a decoding method to assign jobs into each machine in subsequent stages when designing a heuristi...
متن کاملMetaheuristic Algorithms for Hybrid Flow-Shop Scheduling Problem with Multiprocessor Tasks
This paper is concerned with hybrid flow-shop scheduling problem involving multiprocessor tasks. The hybrid flow-shop problem is a generalization of the classical flow-shop problem by permitting multiple parallel processors at each stage of task processing. The multiprocessor tasks, on the other hand, overcome the restriction of the classical scheduling problems by allowing tasks to be processe...
متن کاملClimbing Depth-Bounded Adjacent Discrepancy Search for Solving Hybrid Flow Shop Scheduling Problems with Multiprocessor Tasks
This paper considers multiprocessor task scheduling in a multistage hybrid flow-shop environment. The problem even in its simplest form is NP-hard in the strong sense. The great deal of interest for this problem, besides its theoretical complexity, is animated by needs of various manufacturing and computing systems. We propose a new approach based on limited discrepancy search to solve the prob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Industrial Engineering
سال: 2013
ISSN: 0360-8352
DOI: 10.1016/j.cie.2013.08.004